CUI, Ying - HKUST Class Schedule & Quota

Class Schedule & Quota
2025-26 Spring 2025-26 Winter 2025-26 Fall 2024-25 Summer
2025-26 Spring
Common Core Course
The class information on this page will normally be updated every 15 to 20 minutes during class enrollment period.
» Student Information System (SIS)» PG Program/Course Catalog
Notes & Links
This service was first adapted from a student contribution in 2011-12 Fall. The efforts of all concerned are duly acknowledged.

AIAA AMAT BSBE CMAA CNCC CNGF DLED DSAA EOAS FTEC FUNH INFH INTR IOTA IPEN LANG MICS MSSM PDEV PLED ROAS SEEN SMMG SOCH SYSH UCMP UCUG UFUG UGOD

COURSE INFO

PRE-REQUISITE	DSAA 2011 OR DSAA 2012 OR AIAA 3111
CROSS CAMPUS COURSE EQUIVALENCE	MATH 4335
DESCRIPTION	This course introduces fundamental theory and techniques of optimization. Topics include linear programming, unconstrained optimization, and constrained optimization. Numerical implementations of optimization methods are also discussed.

DSAA 4086 - Introduction to Optimization (3 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L01 (6402)	Tu 12:00PM - 02:50PM	Rm 201, E1	CUI, Ying	40	0	40	0
T01 (6403)	Fr 07:30PM - 08:20PM	Rm 150, E1	CUI, Ying	40	0	40	0

COURSE INFO

VECTOR	[3-0-0:3]
DESCRIPTION	This course covers advanced theory, algorithms, and applications for convex and nonconvex optimization, including: subgradient methods, localization methods, decomposition methods, proximal methods, alternating direction methods of multipliers, conjugate direction methods, successive approximation methods, convex-cardinality problems, low-rank optimization problems, neural networks, semidefinite programming and relaxation, robust optimization, discrete optimization, stochastic optimization, etc.

VECTOR

[3-0-0:3]

DESCRIPTION

This course covers advanced theory, algorithms, and applications for convex and nonconvex optimization, including: subgradient methods, localization methods, decomposition methods, proximal methods, alternating direction methods of multipliers, conjugate direction methods, successive approximation methods, convex-cardinality problems, low-rank optimization problems, neural networks, semidefinite programming and relaxation, robust optimization, discrete optimization, stochastic optimization, etc.

IOTA 5502 - Convex and Nonconvex Optimization II (3 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L01 (6110)	Mo 03:00PM - 05:50PM	Rm 101, E4	CUI, Ying	20	0	20	0

COURSE INFO

VECTOR	[2-0-0:2]
PREVIOUS CODE	IIMP 6010
DESCRIPTION	This course focuses on using various approaches to perform quantitative analysis through real-world examples. Students will learn how to use different tools in an interdisciplinary project and how to acquire new skills on their own. The course offers different modules that are multidisciplinary/multifunctional and generally applicable to a wide class of problems. May be graded PP.

UCMP 6010 - Cross-disciplinary Research Methods I (2 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L01 (6302)	TBA	TBA	CHI, Jinshu CUI, Ying LI, Lei LIU, Hao SHEN, Yang TAN, Chee Keong YUE, Liang ZHANG, Yi ZHAO, Hang	350	0	350	0